Simpler multicoloring of triangle-free hexagonal graphs
نویسندگان
چکیده
منابع مشابه
Simpler multicoloring of triangle-free hexagonal graphs
Given a graph G and a demand function p : V (G) → N, a proper n-[p]coloring is a mapping f : V (G) → 2{1,...,n} such that |f(v)| ≥ p(v) for any vertex v ∈ V (G) and f(v) ∩ f(u) = ∅ for any two adjacent vertices u and v. The least integer n for which a proper n-[p]coloring exists, χp(G), is called the multichromatic number of G. Finding the multichromatic number of induced subgraphs of the trian...
متن کاملA technique for multicoloring triangle-free hexagonal graphs
In order to avoid interference in cellular telephone networks, sets of radio frequencies are to be assigned to transmitters such that adjacent transmitters are allotted disjoint sets of frequencies. Often these transmitters are laid out like vertices of a triangular lattice in a plane. This problem corresponds to the problem of multicoloring an induced subgraph of a triangular lattice with inte...
متن کاملA Distributed 6/5-competitive Algorithm for Multicoloring Triangle-free Hexagonal Graphs
An important optimization problem in the design of cellular networks is to assign sets of frequencies to transmitters to avoid unacceptable interference. A cellular network is generally modeled as a subgraph of the infinite triangular lattice. The distributed frequency assignment problem can be abstracted as a multicoloring problem on a weighted hexagonal graph, where the weight vector represen...
متن کاملCircular chromatic number of triangle-free hexagonal graphs
An interesting connection between graph homomorphisms to odd cycles and circular chromatic number is presented. By using this connection, bounds for circular chromatic number of triangle-free hexagonal graphs (i.e. induced subgraphs of triangular lattice) are given.
متن کامل1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by frequencies assigned to them, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of used freque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.07.031